Polymatroid Prophet Inequalities
نویسندگان
چکیده
Consider a gambler and a prophet who observe a sequence of independent, non-negative numbers. The gambler sees the numbers one-by-one whereas the prophet sees the entire sequence at once. The goal of both is to decide on fractions of each number they want to keep so as to maximize the weighted fractional sum of the numbers chosen. The classic result of Krengel and Sucheston (1977-78) asserts that if both the gambler and the prophet can pick one number, then the gambler can do at least half as well as the prophet. Recently, Kleinberg and Weinberg (2012) have generalized this result to settings where the numbers that can be chosen are subject to a matroid constraint. In this note we go one step further and show that the bound carries over to settings where the fractions that can be chosen are subject to a polymatroid constraint. This bound is tight as it is already tight for the simple setting where the gambler and the prophet can pick only one number. An interesting application of our result is in mechanism design, where it leads to improved results for various problems.
منابع مشابه
Lifted Polymatroid Inequalities for Mean-risk Optimization with Indicator Variables
We investigate a mixed 0 − 1 conic quadratic optimization problem with indicator variables arising in mean-risk optimization. The indicator variables are often used to model non-convexities such as fixed charges or cardinality constraints. Observing that the problem reduces to a submodular function minimization for its binary restriction, we derive three classes of strong convex valid inequalit...
متن کاملSubmodularity in Conic Quadratic Mixed 0-1 Optimization
We describe strong convex valid inequalities for conic quadratic mixed 0-1 optimization. The inequalities exploit the submodularity of the binary restrictions and are based on the polymatroid inequalities over binaries for the diagonal case. We prove that the convex inequalities completely describe the convex hull of a single conic quadratic constraint as well as the rotated cone constraint ove...
متن کاملMatroid Intersections, Polymatroid Inequalities, and Related Problems
Given m matroids M1, . . . ,Mm on the common ground set V , it is shown that all maximal subsets of V , independent in the m matroids, can be generated in quasi-polynomial time. More generally, given a system of polymatroid inequalities f1(X) ≥ t1, . . . , fm(X) ≥ tm with quasi-polynomially bounded right hand sides t1, . . . , tm, all minimal feasible solutions X ⊆ V to the system can be genera...
متن کاملProphet Inequalities with Limited Information
In the classical prophet inequality, a gambler observes a sequence of stochastic rewards V1, ..., Vn and must decide, for each reward Vi, whether to keep it and stop the game or to forfeit the reward forever and reveal the next value Vi. The gambler’s goal is to obtain a constant fraction of the expected reward that the optimal offline algorithm would get. Recently, prophet inequalities have be...
متن کاملAn inequality for polymatroid functions
An integral-valued set function f : 2V 7→ Z is called polymatroid if it is submodular, non-decreasing, and f(∅) = 0. Given a polymatroid function f and an integer threshold t ≥ 1, let α = α(f, t) denote the number of maximal sets X ⊆ V satisfying f(X) < t, let β = β(f, t) be the number of minimal sets X ⊆ V for which f(X) ≥ t, and let n = |V |. We show that if β ≥ 2 then α ≤ β(log t)/c, where c...
متن کامل